To mine the process model including multi-concurrent 2-loops of triangles in incomplete logs, an AlphaMatch algorithm based on extended Alpha algorithm was proposed. Two activities in triangle structure could be correctly matched in 2-loops of triangles by AlphaMatch in the log without repeated activity sequence, thus the process model with multi-concurrent 2-loops of triangles could be mined. Firstly, the activities in 2-loops of triangles were divided into two categories according to the number of activities. Then, a matrix of head and tail position of the activities was constructed to match the two categories and a footprint matrix was constructed to show the relationship between activities. Finally, a large number of experiments were carried out on ProM platform from model correctness, mining efficiency, fitness and precison. Experimental results show that the Petri net model including multi-concurrent 2-loops of triangles can be mined efficiently by the proposed algorithm.
Multiple Kernel Learning and Support Vector Machine (MKL-SVM) was applied to automatic music genre classification to choose the optimal kernel functions for different features, a method of conducting the optimal kernel function combination into the synthetic kernel function by weighting for music genre classification was proposed. Different optimal kernel functions were chosen for different acoustic features by multiple kernel classification learning, the weight of each kernel function in classification was obtained, and the weight of each acoustic feature in the classification of the genre was clarified, which provided a clear and definite result for the analysis and selection of the feature vector in the classification of music genre. The experiments on the dataset of ISMIR 2011 show that, compared with the traditional single kernel support vector machine classification, the accuracy of the proposed music genre automatic classification method based on MKL-SVM is greatly improved by 6.58%. And the proposed method can more clearly reveal the the different features' impacts on music genre classification results, the classification results has also been significantly improved by selecting features with larger effects on classification.
To overcome slow convergence velocity of Particle Swarm Optimization (PSO) which falls into local optimum easily, the paper proposed a new approach, a PSO algorithm using opposition-based learning and adaptive escape. The proposed algorithm divided states of population evolution into normal state and premature state by setting threshold. If popolation is in normal state, standard PSO algorithm was adopted to evolve; otherwise, it falls into "premature", the algorithm with opposition-based learning strategy and adaptive escape was adopted, the individual optimal location generates the opposite solution by opposition-based learning, increases the learning ability of particle, enhances the ability to escape from local optimum, and raises the optimizing rate. Experiments were conducted on 8 classical benchmark functions, the experimental results show that the proposed algorithm has better convergence velocity and precision than classical PSO algorithm, such as Fully Imformed Particle Swarm optimization (FIPS), self-organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients (HPSO-TVAC), Comprehensive Learning Particle Swarm Optimizer (CLPSO), Adaptive Particle Swarm Optimization (APSO), Double Center Particle Swarm Optimization (DCPSO) and Particle Swarm Optimization algorithm with Fast convergence and Adaptive escape (FAPSO).
As standard Particle Swarm Optimization (PSO) algorithm has some shortcomings, such as getting trapped in the local minima, converging slowly and low precision in the late of evolution, a new improved PSO algorithm based on Gaussian disturbance (GDPSO) was proposed. Gaussian disturbance was put into in the personal best positions, which could prevent falling into local minima and improve the convergence speed and accuracy. While keeping the same number of function evaluations, the experiments were conducted on eight well-known benchmark functions with dimension of 30. The experimental results show that the GDPSO algorithm outperforms some recently proposed PSO algorithms in terms of convergence speed and solution accuracy.